Hash function generation by means of Gene Expression Programming
نویسندگان
چکیده
منابع مشابه
Hash function generation by means of Gene Expression Programming
Cryptographic hash functions are fundamental primitives in modern cryptography and have many security applications (data integrity checking, cryptographic protocols, digital signatures, pseudo random number generators etc.). At the same time novel hash functions are designed (for instance in the framework of the SHA-3 contest organized by the National Institute of Standards and Technology (NIST...
متن کاملForecasting copper price using gene expression programming
Forecasting the prices of metals is important in many aspects of economics. Metal prices are also vital variables in financial models for revenue evaluation, which forms the basis of an effective payment regime using resource policymakers. According to the severe changes of the metal prices in the recent years, the classic estimation methods cannot correctly estimate the volatility. In order to...
متن کاملPrediction of Acid Mine Drainage Generation Potential of A Copper Mine Tailings Using Gene Expression Programming-A Case Study
This work presents a quantitative predicting likely acid mine drainage (AMD) generation process throughout tailing particles resulting from the Sarcheshmeh copper mine in the south of Iran. Indeed, four predictive relationships for the remaining pyrite fraction, remaining chalcopyrite fraction, sulfate concentration, and pH have been suggested by applying the gene expression programming (GEP) a...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملBent Function Synthesis by Means of Cartesian Genetic Programming
In this paper, a new approach to synthesize bent Boolean functions by means of Cartesian Genetic Programming (CGP) is proposed. Bent functions have important applications in cryptography due to their high nonlinearity. However, they are very rare and their discovery using conventional brute force methods is not efficient enough. We show that by using CGP we can routinely design bent functions o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales UMCS, Informatica
سال: 2012
ISSN: 2083-3628,1732-1360
DOI: 10.2478/v10065-012-0027-x